Exponentially Dense Matroids

نویسندگان

  • Alexander Peter Nelson
  • Bertrand Guenin
چکیده

This thesis deals with questions relating to the maximum density of rank-n matroids in a minor-closed class. Consider a minor-closed class M of matroids that does not contain a given rank-2 uniform matroid. The growth rate function is defined by hM(n) = max (|M | : M ∈M simple, r(M) ≤ n) . The Growth Rate Theorem, due to Geelen, Kabell, Kung, and Whittle, shows that the growth rate function is either linear, quadratic, or exponential in n. In the case of exponentially dense classes, we conjecture that, for sufficiently large n, hM(n) = q − 1 q − 1 − c, where q is a prime power, and k and c are non-negative integers depending only on M. We show that this holds for several interesting classes, including the class of all matroids with no U2,t-minor. We also consider more general minor-closed classes that exclude an arbitrary uniform matroid. Here the growth rate, as defined above, can be infinite. We define a more suitable notion of density, and prove a growth rate theorem for this more general notion, dividing minor-closed classes into those that are at most polynomially dense, and those that are exponentially dense.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Projective geometries in exponentially dense matroids. II

We show for each positive integer a that, if M is a minor-closed class of matroids not containing all rank-(a+ 1) uniform matroids, then there exists an integer c such that either every rank-r matroid in M can be covered by at most r rank-a sets, or M contains the GF(q)-representable matroids for some prime power q and every rank-r matroid inM can be covered by at most cq rank-a sets. In the la...

متن کامل

Odd circuits in dense binary matroids

The exclusion of odd circuits from a binary matroid here is natural. The geometric density Hales-Jewett theorem [3] implies that dense GF(q)representable matroids with sufficiently large rank necessarily contain arbitrarily large affine geometries over GF(q); these geometries contain circuits of every possible even cardinality when q= 2 and circuits of every possible cardinality when q>2. So de...

متن کامل

Growth rates of minor-closed classes of matroids

For a minor-closed class M of matroids, we let h(k) denote the maximum number of elements of a simple rank-k matroid in M. We prove that, if M does not contain all simple rank-2 matroids, then h(k) grows either linearly, quadratically, or exponentially.

متن کامل

Strongly Inequivalent Representations and Tutte Polynomials of Matroids

We develop constructive techniques to show that non-isomorphic 3-connected matroids that are representable over a fixed finite field and that have the same Tutte polynomial abound. In particular, for most prime powers q, we construct infinite families of sets of 3-connected matroids for which the matroids in a given set are non-isomorphic, are representable over GF(q), and have the same Tutte p...

متن کامل

Unifying duality theorems for width parameters in graphs and matroids II. General duality

We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6].

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011